Transformation Rules for Knowledge-Based Pattern Matching
نویسندگان
چکیده
Many AI tasks require determining whether two knowledge representations encode the same knowledge. For example, rule-based classification requires matching rule antecedents with working memory; information retrieval requires matching queries with documents; and some knowledge-acquisition tasks require matching new information with already encoded knowledge to expand upon and debug both of them. Solving this matching problem is hard because representations may encode the same content but differ substantially in form. Previous approaches to this problem have used either syntactic measures, such as graph edit distance, or semantic knowledge to determine the “distance” between two representations. Although semantic approaches outperform syntactic ones, previous research has focused primarily on the use of taxonomic knowledge. As a result, mismatches between representations go largely unaddressed. In this paper, we investigate whether semantic approaches can be augmented with additional non-taxonomic knowledge to further improve matching. To test this hypothesis, we built a matcher that uses both taxonomic and non-taxonomic knowledge in the form of transformation rules and applied it to the task of critiquing military Courses of Action. We compared our matcher’s performance to both a syntactic and a semantic matcher applied to the same task. From this study, we found the results show that using additional non-taxonomic knowledge further improves matching.
منابع مشابه
Parallelization of Graph Transformation Based on Incremental Pattern Matching
Graph transformation based on incremental pattern matching explicitly stores all occurrences of patterns (left-hand side of rules) and updates this result cache upon model changes. This allows instantaneous pattern queries at the expense of costlier model manipulation and higher memory consumption. Up to now, this incremental approach has considered only sequential execution despite the inheren...
متن کاملMining Transformation Rules for Semantic Matching
Semantic matching is finding a mapping between two knowledge representations encoded using the same ontology. Solving this matching problem is hard because the syntactic form of two knowledge representations rarely matches exactly. Previous research has shown transformation rules can be used to improve matching, but acquiring transformations is difficult. In this paper, we present an algorithm ...
متن کاملFirst-class Rules and Generic Traversal
In this paper we present a functional language supporting first-class rules and generic traversal. This is achieved by generalizing the pattern matching constructs of standard functional languages. The case construct that ties rules together and prevents their reuse, is replaced by separate, firstclass, pattern matching rules and a choice combinator that deals with pattern match failure. Generi...
متن کاملXing: a visual XML query language
We present a visual language for querying and transforming XML data. The language is based on a visual document metaphor and the notion of document patterns and rules. It combines a dynamic form-based interface for defining queries and transformation rules with powerful pattern matching capabilities and offers thus a highly expressive visual language. The design of the visual language is specif...
متن کاملIncremental Pattern Matching in Graph-Based State Space Exploration
Graph pattern matching is among the most costly operations in any graph transformation system. Incremental pattern matching aims at reducing this cost by incrementally updating, as opposed to totally recalculating, the possible matches of rules in the graph grammar at each step of the transformation. In this paper an implementation of one such algorithm is discussed with respect to the GROOVE t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010